Stochastic minimization with adaptive memory
نویسندگان
چکیده
منابع مشابه
Stochastic Minimization with Adaptive Memory
Fig. 12. Comparison between the number of functional evaluations with gaussian and exponential damping functions. The results on a complete sweep on 24 values of m in 0,1] are shown. Finally, we should note that the choice of gaussian damping for the memory mechanism is not critical. We experimented with a pure exponential damping getting similar results. This suggests that the dynamic mechanis...
متن کاملAdaptive Regret Minimization in Bounded-Memory Games
Online learning algorithms that minimize regret provide strong guarantees in situations that involve repeatedly making decisions in an uncertain environment, e.g. a driver deciding what route to drive to work every day. While regret minimization has been extensively studied in repeated games, we study regret minimization for a richer class of games called bounded memory games. In each round of ...
متن کاملAdaptive memory programming for matrix bandwidth minimization
In this paper we explore the influence of adaptive memory in the performance of heuristic methods when solving a hard combinatorial optimization problem. Specifically, we tackle the adaptation of tabu search and scatter search to the bandwidth minimization problem. It consists of finding a permutation of the rows and columns of a given matrix which keeps the non-zero elements in a band that is ...
متن کاملStructure of an Adaptive with Memory Method with Efficiency Index 2
The current research develops derivative-free family with memory methods with 100% improvement in the order of convergence. They have three parameters. The parameters are approximated and increase the convergence order from 4 to 6, 7, 7.5 and 8, respectively. Additionally, the new self-accelerating parameters are constructed by a new way. They have the properties of simple structures and they a...
متن کاملDynamic and Stochastic Resource Minimization
We consider a problem where tasks arrive randomly over time, and all tasks have to be performed using reusable resources before a given deadline. The objective is to minimize the total cost of the operation by minimizing the number of resources used. Two cases are considered: rst the case in which we have no information on future tasks, and then the case in which we know the probability distrib...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 1995
ISSN: 0377-0427
DOI: 10.1016/0377-0427(93)e0203-x